Search for: All records

A linear elastic circular disc is analyzed under a self-equilibrated system of loads applied along its boundary. A distinctive feature of the investigation, conducted using complex variable analysis, is the assumption that the material is incompressible (in its linearized approximation), rendering the governing equations formally identical to those of Stokes flow in viscous fluids. After deriving a general solution to the problem, an isoperimetric constraint is introduced at the boundary to enforce inextensibility. This effect can be physically realized, for example, by attaching an inextensible elastic rod with negligible bending stiffness to the perimeter. Although the combined imposition of material incompressibility and boundary inextensibility theoretically prevents any deformation of the disc, it is shown that the problem still admits non-trivial solutions. This apparent paradox is resolved by recognizing the approximations inherent in the linearized theory, as confirmed by a geometrically nonlinear numerical analysis. Nonetheless, the linear solution retains significance: it may represent a valid stress distribution within a rigid system and can identify critical conditions of interest for design applications. 

The finite element algorithm is developed to solve antiplane problems involving elastic domains whose boundaries or their parts are coated with thin and relatively stiff layers. These layers are modeled by the vanishing thickness Gurtin–Murdoch material surfaces that could be open or closed, and smooth or non-smooth. The governing equations for the problems are derived using variational arguments. The domains are discretized using triangular finite elements. In general, standard linear elements are used to approximate displacements in the domain. However, to capture the singular behavior of the elastic fields near the tips of the open Gurtin–Murdoch surfaces, a novel blended singular element is devised. Numerical examples are presented to demonstrate the accuracy and robustness of the algorithm developed.